An R2 Indicator and Decomposition Based Steady-State Evolutionary Algorithm for Many-Objective Optimization
نویسندگان
چکیده
منابع مشابه
IGD Indicator-based Evolutionary Algorithm for Many-objective Optimization Problems
Inverted Generational Distance (IGD) has been widely considered as a reliable performance indicator to concurrently quantify the convergence and diversity of multiand manyobjective evolutionary algorithms. In this paper, an IGD indicatorbased evolutionary algorithm for solving many-objective optimization problems (MaOPs) has been proposed. Specifically, the IGD indicator is employed in each gen...
متن کاملMulti-objective optimization design of plate-fin heat sinks using an Evolutionary Algorithm Based On Decomposition
This article has no abstract.
متن کاملA new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization
The convergence and the diversity are two main goals of an evolutionary algorithm for many-objective optimization problems. However, achieving these two goals simultaneously is the difficult and challenging work for multi-objective evolutionary algorithms. A uniform evolutionary algorithm based on decomposition and the control of dominance area of solutions (CDAS) is proposed to achieve these t...
متن کاملA Decomposition Based Evolutionary Algorithm for Many Objective Optimization with Systematic Sampling and Adaptive Epsilon Control
• Many objective optimization typically refers to problems with the number of objectives greater than four. • The commonly used dominance based methods for multi-objective optimization, such as NSGA-II, SPEA2 etc. are known to be inefficient for many-objective optimization as non-dominance does not provide adequate selection pressure to drive the population towards convergence. • There are also...
متن کاملEvolutionary Many-Objective Optimization Based on Adversarial Decomposition
The decomposition-based method has been recognized as a major approach for multiobjective optimization. It decomposes a multi-objective optimization problem into several singleobjective optimization subproblems, each of which is usually defined as a scalarizing function using a weight vector. Due to the characteristics of the contour line of a particular scalarizing function, the performance of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2018
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2018/1435463